Search Complexities for HTN Planning
نویسندگان
چکیده
منابع مشابه
Open-Ended Domain Model for Continual Forward Search HTN Planning
Domain models for automated planning systems often rely on the closed world assumption. Unfortunately, the closed world assumption is unreasonable in many real world planning domains. We propose an open-ended domain model based on definite clauses that can be flexibly extended and is able to automatically determine relevant but unknown information. The determination of relevant but unknown info...
متن کاملHTN Planning with Quantitative Preferences via Heuristic Search
In this paper, we address the problem of generating preferred plans by combining the procedural control knowledge specified by Hierarchical Task Networks (HTNs) with rich user preferences. To this end, we extend the popular Plan Domain Description Language, PDDL3, to support specification of preferences over HTN constructs. To compute preferred HTN plans, we propose a branch-and-bound algorithm...
متن کاملTight Bounds for HTN Planning
Although HTN planning is in general undecidable, there are many syntactically identifiable sub-classes of HTN problems that can be decided. For these sub-classes, the decision procedures provide upper complexity bounds. Lower bounds were often not investigated in more detail, however. We generalize a propositional HTN formalization to one that is based upon a function-free first-order logic and...
متن کاملApplying Anytime Heuristic Search to Cost-Optimal HTN Planning
This paper presents a framework for cost-optimal HTN planning. The framework includes an optimal algorithm combining a branch-and-bound with a heuristic search, which can also be used as a near-optimal algorithm given a time limit. It also includes different heuristics based on weighted cost estimations and different decomposition strategies. The different elements from this framework are empir...
متن کاملTitle of Dissertation: Eecient Reenement Strategies for Htn Planning Eecient Reenement Strategies for Htn Planning
Title of Dissertation: E cient Re nement Strategies for HTN Planning Reiko Tsuneto, Doctor of Philosophy, 1999 Dissertation directed by: Professor James Hendler Department of Computer Science Professor Dana Nau Department of Computer Science The e ciency of planning greatly depends on the type of re nement strategy the planner uses, but little is understood about the conditions under which each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KI - Künstliche Intelligenz
سال: 2015
ISSN: 0933-1875,1610-1987
DOI: 10.1007/s13218-015-0396-6